package com.hdu.point_offer;

/**
 * <a href="https://leetcode.cn/problems/ti-huan-kong-ge-lcof/?envType=study-plan-v2&envId=coding-interviews">LCR 122. 路径加密</a>
 */
public class lcr122 {
    class Solution {
        public String pathEncryption(String path) {
            char[] s = new char[path.length()];
            for (int i = 0; i < path.length(); i++)
            {
                if (path.charAt(i) == '.') s[i] = ' ';
                else s[i] = path.charAt(i);
            }
            return new String(s);
        }
    }
}
